Extremal behaviour of ± 1-valued completely multiplicative functions in function fields

نویسندگان

چکیده

We investigate the classical Pólya and Turán conjectures in context of rational function fields over finite

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Completely Multiplicative Automatic Functions

We show that a completely multiplicative automatic function, which dos not have 0 as value, is almost periodic.

متن کامل

Multiplicative valued difference fields

The theory of valued difference fields (K,σ, v) depends on how the valuation v interacts with the automorphism σ. Two special cases have already been worked out the isometric case, where v(σ(x)) = v(x) for all x ∈ K, has been worked out by Luc Belair, Angus Macintyre and Thomas Scanlon; and the contractive case, where v(σ(x)) > nv(x) for all x ∈ K× with v(x) > 0 and n ∈ N, has been worked out b...

متن کامل

Completely multiplicative functions arising from simple operations

Given two multiplicative arithmetic functions, various conditions for their convolution, powers , and logarithms to be completely multiplicative, based on values at the primes, are derived together with their applications.

متن کامل

Notes on extremal and Tame Valued Fields

We extend the characterization of extremal valued fields given in [1] to the missing case of valued fields of mixed characteristic with perfect residue field. This leads to a complete characterization of the tame valued fields that are extremal. The key to the proof is a model theoretic result about tame valued fields in mixed characteristic. Further, we prove that in an extremal valued field o...

متن کامل

Multiplicative complexity of vector valued Boolean functions

We consider the multiplicative complexity of Boolean functions with multiple bits of output, studying how large a multiplicative complexity is necessary and sufficient to provide a desired nonlinearity. For so-called ΣΠΣ circuits, we show that there is a tight connection between error correcting codes and circuits computing functions with high nonlinearity. Combining this with known coding theo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Glasnik Matematicki

سال: 2021

ISSN: ['1846-7989', '0017-095X']

DOI: https://doi.org/10.3336/gm.56.1.06